排序方式: 共有8条查询结果,搜索用时 15 毫秒
1
1.
2.
An associative ring with identity R is called Armendariz if, whenever (∑^m i=0^aix^i)(∑^n j=0^bjx^j)=0 in R[x],aibj=0 for all i and j. An associative ring with identity is called reduced if it has no non-zero nilpotent elements. In this paper, we define a general reduced ring (with or without identity) and a general Armendariz ring (with or without identity), and identify a class of maximal general Armendariz subrings of matrix rings over general reduced rings. 相似文献
3.
如果图G的一个正常边染色满足相邻点的色集不同,且任意两种颜色所染边数目相差不超过1,则称为均匀邻强边染色,其所用最少染色数称为均匀邻强边色数.本文得到了路、圈、星和扇的Mycielski图的均匀邻强边色数. 相似文献
4.
如果图G的一个正常边染色满足任意两个不同点的关联边色集不同,且任意两种颜色所染边数目相差不超过1,则称为点可区别均匀边染色(VDEEC),其所用最少染色数称为点可区别均匀边色数.本文用构造法研究了一些Mycielski图的点可区别均匀边染色,得到了星和扇的Mycielski图的点可区别均匀边色数,验证了它们满足点可区别均匀边染色猜想. 相似文献
5.
设α是环R的一个自同态,称环R是α-斜Armendariz环,如果在R[x;α]中,(∑_(i=0)~ma_ix~i)(∑_(j=0)~nb_jx~j)=0,那么a_ia~i(b_j)=0,其中0≤i≤m,0≤j≤n.设R是α-rigid环,则R上的上三角矩阵环的子环W_n(p,q)是α~—-斜Armendariz环. 相似文献
6.
如果图G的一个正常边染色满足相邻点的色集不同,且任意两种颜色所染边数目相差不超过1,则称为均匀邻强边染色,其所用最少染色数称为均匀邻强边色数.本文得到了星、扇和轮的倍图的均匀邻强边色数. 相似文献
7.
8.
Let M be a monoid. Maximal M-Armendariz subrings of upper triangular matrix rings are identified when R is M-Armendariz and reduced. Consequently, new families of M- Armendariz rings are presented. 相似文献
1